First-order aspects of Coxeter groups
نویسندگان
چکیده
We lay the foundations of first-order model theory Coxeter groups. Firstly, with exception 2-spherical non-affine case (which we leave open), characterize superstable groups finite rank, which show to be essentially affine type. Secondly, rank are domains, a central assumption in algebraic geometry over groups, many respects (e.g. λ -stability) reduces given system its associated irreducible components. In second part paper move specific definability questions right-angled (RACGs) and this respect, firstly, prove that RACGs do not have proper elementary subgroups further reflection independent ones at all. if monoid S i m ( W , ) -self-similarities is finitely generated, then prime theory. Thirdly, elements type-determined. proving irreducible, even affine, theory, Γ Θ as previous sentence, equivalent only ≅ thus solving equivalence problem for most last focus on theoretic applications notion length from group particular connected.
منابع مشابه
The Order Dimension of Bruhat Order on Infinite Coxeter Groups
We give a quadratic lower bound and a cubic upper bound on the order dimension of the Bruhat (or strong) ordering of the affine Coxeter group Ãn. We also demonstrate that the order dimension of the Bruhat order is infinite for a large class of Coxeter groups.
متن کاملEssays on Coxeter groups Coxeter elements in finite Coxeter groups
A finite Coxeter group possesses a distinguished conjugacy class of Coxeter elements. The literature about these is very large, but it seems to me that there is still room for a better motivated account than what exists. The standard references on thismaterial are [Bourbaki:1968] and [Humphreys:1990], butmy treatment follows [Steinberg:1959] and [Steinberg:1985], from which the clever parts of ...
متن کاملSome Combinatorial Aspects of Reduced Words in Finite Coxeter Groups
We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.
متن کاملPolygon Posets and the Weak Order of Coxeter Groups
We explore the connection between polygon posets, which is a class of ranked posets with an edgelabeling which satisfies certain 'polygon properties', and the weak order of Coxeter groups. We show that every polygon poset is isomorphic to a join ideal in the weak order, and for Coxeter groups where no pair of generators have infinite order the converse is also true. The class of polygon posets ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2021.12.033